Trace Expression of r-th Root over Finite Field

نویسندگان

  • Gook Hwa Cho
  • Namhun Koo
  • Eunhye Ha
  • Soonhak Kwon
چکیده

Efficient computation of r-th root in Fq has many applications in computational number theory and many other related areas. We present a new r-th root formula which generalizes Müller’s result on square root, and which provides a possible improvement of the CipollaLehmer type algorithms for general case. More precisely, for given r-th power c ∈ Fq, we show that there exists α ∈ Fqr such that Tr ( α ( ∑r−1 i=0 qi)−r r2 )r = c where Tr(α) = α+α +α 2 + · · ·+αq and α is a root of certain irreducible polynomial of degree r over Fq.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irreducibility and r-th root finding over finite fields

Constructing r-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree re (where r is a prime) over a given finite field Fq of characteristic p (equivalently, constructing the bigger field Fqr ). Both these problems have famous randomized algorithms but the derandomization is an open question. We give some n...

متن کامل

On r-th Root Extraction Algorithm in Fq For q≡lrs+1 (mod rs+1) with 0 < l < r and Small s

We present an r-th root extraction algorithm over a finite field Fq. Our algorithm precomputes a primitive r-th root of unity ξ where s is the largest positive integer satisfying r|q − 1, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for the r-th root computation and is favorably compared to the existing algorithms.

متن کامل

QUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...

متن کامل

ON THE EXISTENCE OF MAXIMAL COHEN-MACAULAY MODULES OVER p th ROOT EXTENSIONS

Let S be an unramified regular local ring having mixed characteristic p > 0 and R the integral closure of S in a pth root extension of its quotient field. We show that R admits a finite, birational module M such that depth(M) = dim(R). In other words, R admits a maximal Cohen-Macaulay module.

متن کامل

Triangularization over finite-dimensional division rings using the reduced trace

In this paper we study triangularization of collections of matrices whose entries come from a finite-dimensional division ring. First, we give a generalization of Guralnick's theorem to the case of finite-dimensional division rings and then we show that in this case the reduced trace function is a suitable alternative for trace function by presenting two triangularization results. The first one...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013